VM Scaling and Load Balancing via Cost Optimal MDP Solution

نویسندگان

چکیده

Dynamic resource allocation mechanism is an essential building block in contemporary cloud computing environment, enabling the support of large variability incoming requests from enormous number applications utilizing such infrastructure. In this article, we devise a dynamic that optimizes application’s profit under set costs and revenues while maintaining performance constraints. Specifically, decision-maker (DM) agent which formulates joint admission control, scaling load balancing problem as stochastic process solvable by Markov decision (MDP) provides optimal policy. Accordingly, at each time instance, DM can determine based on system’s current state, requirements costs, whether to add or release VM (scale-out scale-in, respectively), admit reject upcoming task if admitting it, allocate it to. We explore value function structure provide insights with respect policies produced it. To address scalability issues detailed MDP solution alternative abstract consolidates multiple system states into single hence cope much larger systems expense slight degradation. demonstrate feasibility suggested scheme, designed implemented alongside two traditional auto-scalers, Amazon Web Services (AWS) ran numerous MATLAB simulations AWS-based experiments provided demonstrated superiority against compared with.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally Optimal Load Balancing

This work studies distributed algorithms for locally optimal load-balancing : We are given a graph of maximum degree ∆, and each node has up to L units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (∆ = 2), it is easy to solve the fractional version of the problem in O(L) communication rounds, independentl...

متن کامل

Optimal Load-Balancing (Infocom 2005)

This paper is about load-balancing packets across multiple paths inside a switch, or across a network. It is motivated by the recent interest in load-balanced switches. Load-balanced switches provide an appealing alternative to crossbars with centralized schedulers. A load-balanced switch has no scheduler, is particularly amenable to optics, and – most relevant here – guarantees 100% throughput...

متن کامل

Towards Optimal Load Balancing Topologies

Many load balancing algorithms balance the load according to a topology. Its choice can significantly influence the performance of the algorithm. We consider the two phase balancing model. The first phase calculates a balancing flow with respect to this topology by a diffusion scheme. Its time requirement depends on the maximum node degree and on the number of eigenvalues of the network. The se...

متن کامل

Cost-eeective Data-parallel Load Balancing Cost-eeective Data-parallel Load Balancing

Load balancing algorithms improve a program's performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-eeective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon...

متن کامل

Optimal and Alternating-Direction Load Balancing Schemes

We discuss iterative nearest neighbor load balancing schemes on processor networks which are represented by a cartesian product of graphs like e.g. tori or hypercubes. By the use of the Alternating-Direction Loadbalancing scheme, the number of load balance iterations decreases by a factor of 2 for this type of graphs. The resulting ow is analyzed theoretically and it can be very high for certai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Cloud Computing

سال: 2022

ISSN: ['2168-7161', '2372-0018']

DOI: https://doi.org/10.1109/tcc.2020.3000956